Numerical Treatment of Polar CoordinateSingularities

نویسندگان

  • Kamran Mohseni
  • Tim Colonius
چکیده

The treatment of the geometrical singularity in cylindrical and spherical coordinates has for many years been a difficulty in the development of accurate finite difference (FD) and pseudo-spectral (PS) schemes. A variety of numerical procedures for dealing with the singularity have been suggested. For comparative purposes, some of these are discussed in the next sections, but the reader is referred to several books and review papers [3, 7, 10] for more detailed references. Generally, methods discussed in the literature use pole equations, which are akin to boundary conditions to be applied at the singular point. The treatment of the pole as a computational boundary can lead to numerical difficulties. These include the necessity of special boundary closures for FD schemes (e.g., [11]), undesirable clustering of grid points in PS schemes (e.g., [12]), and, in FD schemes, the generation of spurious waves which oscillate from grid point to grid point (so-called two-delta or sawtooth waves, see [4, 26]). In the present paper we investigate a method for treating the coordinate singularity whereby singular coordinates are redefined so that data are differentiated smoothly through the pole, and we avoid placing a grid point directly at the pole. This eliminates the need for any pole equation. Despite the simplicity of the present technique, it appears to be an effective and systematic way to treat many scalar and vector equations in cylindrical and spherical coordinates. A similar technique was used by Merilees [17] for the south and north pole singularities of spherical coordinates but appears not to have been applied more generally. Here we show that the technique leads to excellent results for a number of model problems. The main application we consider is the compressible unsteady Euler and Navier–Stokes equations in cylindrical coordinates (Section 3). For comparison with other methods, we also treat the solution of Bessel’s equation in Section 4. Several

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

متن کامل

The Complementary Functions Method (CFM) Solution to the Elastic Analysis of Polar Orthotropic Rotating Discs

This study primarily deals with introducing an efficient numerical technique called the Complementary Functions Method (CFM) for the solutions of the initial value problem for the linear elastic analysis of anisotropic rotating uniform discs. To bring the performance of the method to light, first, closed form formulas are derived for such discs. The governing equation of the problem at stake is...

متن کامل

Numerical Modeling of Two-Layered Micropolar Fluid Through an Normal and Stenosed Artery

In the present work a two fluid model for blood flow through abnormally constrictedhuman artery (stenosed artery) has been developed. The model consists of a core region of suspensionof all erythrocytes assumed to be micro-polar fluid so as to include the micro-structural effects inaddition to the peripheral-layer viscosity effects, and a peripheral plasma layer free from cells of anykind of Ne...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Properties of matrices with numerical ranges in a sector

Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999